Parallel Strategy for Solving Block-Tridiagonal Linear Systems
نویسندگان
چکیده
Efficient parallel iterative algorithm is investigated for solving block-tridiagonal linear systems on distributed-memory multi-computers. Based on Galerkin theory, the communication only need twice between the adjacent processors per iteration step. Furthermore, the condition for convergence was given when the coefficient matrix A is a symmetric positive definite matrix. Numerical experiments implemented on the cluster verify that our algorithm parallel acceleration rates and efficiency are higher than the multi-splitting one, and has the advantages over the multisplitting one of high efficiency and low memory space.
منابع مشابه
A Parallel Algorithm for Circulant Tridiagonal Linear Systems
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal syste...
متن کاملA New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation
In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...
متن کاملFast Banded Linear Equation Solvers
A new algorithm for solving triangular linear equations is reported that is signiicantly faster than conventional methods on vector and parallel architectures for small bandwidths. In essence, it is a block version of the cyclic reduction algorithm used for tridiagonal systems of equations, and is applicable to general banded systems as well.
متن کاملA parallel version of some block preconditionings
The block preconditioned conjugate gradient (BPCG) methods, even if very effective for solving the linear systems deriving from the discretization of partial differential equations, are not efficient for parallel computers. The bottleneck for their parallel implementation is represented by the solution of the linear system to obtain the preconditioned residual. Here, we present a parallel versi...
متن کاملA parallel solver for tridiagonal linear systems for distributed memory parallel computers
Brugnano, L_, A parallel solver for tridiagonal linear systems for distributed memory parallel computers, Parallel Computing 17 (1991) 1017-1023. The solution of linear tridiagonal systems is a very common problem in Numerical Analysis. Many algorithms are known for solving such linear systems on vector and parallel computers [3,4,6-9]. In this paper a new parallel method is presented, which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016